Practical Fully Homomorphic Encryption for Integers over Polynomial Quotient Rings
نویسندگان
چکیده
In this article we describe a simplified version of Polly Cracker-style fully homomorphic encryption scheme. The main feature of our scheme is an ability to define a strict upper bound of ciphertext size when performing calculations on it for both addition and multiplication. Combined with homomorphic properties of Polly Cracker it’s able to reach high calculation performance without degrading in time. Another important aspect is utilization of large finite rings for calculations in untrusted environment, which prevents most of known attacks on Polly Cracker family.
منابع مشابه
New Fully Homomorphic Encryption over the Integers
We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardness of finding an approximate-GCD problem over the integers, which is given a list of integers perturbed by the small error noises, removing the assumption of the sparse subset sum problem in the ori...
متن کاملFully Homomorphic Encryption over the Integers
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to construct fully homomorphic scheme from a “bootstrappable” somewhat homomorphic scheme. However, instead of using ideal lattices over a polynomial ring, our bootstrappable encryption scheme merely uses addition and multiplication over the integers. The main appeal of...
متن کاملPractical Homomorphic Encryption Over the Integers
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this appears sufficient for most practical applications. In this setting, our schemes lead to practical key and ciphertext sizes. We present a sequence of general...
متن کاملMulti-bit homomorphic encryption based on learning with errors over rings
Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication can be performed in ~ (nlog n) scalar operations, and ciphertext size is reduced at the same time. The CPA security of this scheme can be reduced into RLWE...
متن کاملHomomorphically Encrypted Arithmetic Operations Over the Integer Ring
Fully homomorphic encryption allows cloud servers to evaluate any computable functions for clients without revealing any information. It attracts much attention from both of the scientific community and the industry since Gentry’s seminal scheme. Currently, the BrakerskiGentry-Vaikuntanathan scheme with its optimizations is one of the most potentially practical schemes and has been implemented ...
متن کامل